Pendekatan Matriks Ketetanggaan Berbobot untuk Solusi Minimum Spanning Tree (MST)

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Watermarking pada Video: Robustness, Impercetibility dan Pendekatan untuk Domain Terkompresi

ABSTRAK Meningkatnya penggunaan dokumen digital khususnya multimedia (citra, audio, video) dan kemudahan transmisi data melalui Internet meningkatkan kebutuhan terhadap keamanan data terhadap pelanggaran hak cipta. Watermarking merupakan pendekatan yang telah banyak digunakan dan merupakan bagian dari Digital Right Management (DRM) yang dibuat untuk memenuhi kebutuhan tersebut. Khusus untuk vid...

متن کامل

4 Minimum Spanning Tree

This first algorithm is quite simple. (Though this was probably known earlier, its proof can be found in Prof. Indyk’s 1999 paper “Sublinear Time Algorithms for Metric Space Problems”.) Let Dij denote the distance between a pair of points i and j, over m total points. The entries of Dij must satisfy the triangle inequality; additionally the matrix is symmetric. Note that the matrix size (i.e., ...

متن کامل

An Efficient Distance-Energy-based Minimum Spanning Tree (DE-MST) for Wireless Sensor Networks

The sensor nodes used in Wireless Sensor Networks (WSN) perform close-range sensing in any environment and are compact, battery-powered, light-weight devices. The overall network performance depends on the routing protocols in the network layer and the flow control protocols at the data link layer. This study proposes a novel routing protocol by adapting the Minimum Spanning Tree (MST), Low-Ene...

متن کامل

An Efficient Distance-Energy-based Minimum Spanning Tree (DE-MST) for Wireless Sensor Networks

The sensor nodes used in Wireless Sensor Networks (WSN) perform close-range sensing in any environment and are compact, battery-powered, light-weight devices. The overall network performance depends on the routing protocols in the network layer and the flow control protocols at the data link layer. This study proposes a novel routing protocol by adapting the Minimum Spanning Tree (MST), Low-Ene...

متن کامل

An Efficient Distance-Energy-based Minimum Spanning Tree (DE-MST) for Wireless Sensor Networks

The sensor nodes used in Wireless Sensor Networks (WSN) perform close-range sensing in any environment and are compact, battery-powered, light-weight devices. The overall network performance depends on the routing protocols in the network layer and the flow control protocols at the data link layer. This study proposes a novel routing protocol by adapting the Minimum Spanning Tree (MST), Low-Ene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: STRING (Satuan Tulisan Riset dan Inovasi Teknologi)

سال: 2020

ISSN: 2549-2837,2527-9661

DOI: 10.30998/string.v4i3.5900